MARCO: A High-performance Task <u>M</u> apping <u>a</u> nd <u>R</u> outing <u>Co</u> -optimization Framework for Point-to-Point NoC-based Heterogeneous Computing Systems

نویسندگان

چکیده

Heterogeneous computing systems (HCSs), which consist of various processing elements (PEs) that vary in their ability, are usually facilitated by the network-on-chip (NoC) to interconnect its components. The emerging point-to-point NoCs support single-cycle-multi-hop transmission, reduce or eliminate latency dependence on distance, addressing scalability concern raised high for long-distance transmission and enlarging design space routing algorithm search non-shortest paths. For such NoC-based HCSs, resource management strategies managed compilers, scheduler, controllers, e.g., mapping routing, complicated following reasons: (i) Due heterogeneity, need optimize computation communication concurrently (for homogeneous systems, only communication). (ii) Conducting consecutively cannot minimize schedule length most cases since PEs with ability may locate crowded area suffer from contention overhead. (iii) Since changing selection one task will reconstruct whole space, exploration is challenging. Therefore, this work, we propose MARCO, m apping a nd r outing co -optimization framework, decrease applications HCSs. Specifically, revise tabu explore evaluate quality routing. advanced reinforcement learning (RL)algorithm, i.e., advantage actor-critic, adopted efficiently compute We perform extensive experiments real applications, demonstrates MARCO achieves remarkable performance improvement terms (+44.94% ? +50.18%) when compared state-of-the-art co-optimization systems. also compare different combinations approaches.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

Task Scheduling Algorithm for High Performance Heterogeneous Distributed Computing Systems

The main objective of task scheduling is to assign tasks onto available processors with the aim of producing minimum schedule length and without violating the precedence constraints. Several algorithms have been proposed for solving task-scheduling problem. The most of them doesn't take into account the average communication of parents and data ready time. In this paper, a new static scheduling...

متن کامل

High Performance , Point - to - Point , Transmission Line

Inter-chip signaling latency and bandwidth can be key factors limiting the performance of large VLSI systems. We present a high performance, transmission line signaling scheme for point-to-point communications between VLSI components. In particular , we detail circuitry which allows a pad driver to sense the voltage level on the attached pad during signaling and adjust the drive impedance to ma...

متن کامل

AIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems

The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions in Embedded Computing Systems

سال: 2021

ISSN: ['1539-9087', '1558-3465']

DOI: https://doi.org/10.1145/3476985